Blending randomness in closed queueing network models
نویسندگان
چکیده
منابع مشابه
Price-Directed Control of a Closed Logistics Queueing Network
Motivated by one of the leading intermodal logistics suppliers in the United States, we consider an internal pricing mechanism for managing a fleet of service units (shipping containers) flowing in a closed queueing network. Nodes represent geographic locations and arcs represent travel between them. Customer requests for arcs arrive over time, and the problem is to find an accept/reject policy...
متن کاملA large closed queueing network with autonomous service and bottleneck
This paper studies the queue-length process in a closed Jackson-type queueing network with the large number N of homogeneous customers by methods of the theory of martingales and by the upand down-crossing method. The network considered here consists of a central node (hub), being an infinite-server queueing system with exponentially distributed service times, and k single-server satellite stat...
متن کاملA Multiclass Closed Queueing Network with Unconventional Heavy Traac Behavior
We consider a multiclass closed queueing network model analogous to the open network models of Rybko-Stolyar and Lu-Kumar. The closed network has two single-server stations and a xed customer population of size n. Customers are routed in cyclic fashion through four distinct classes, two of which are served at each station, and each server uses a preemptive-resume priority discipline. The servic...
متن کاملLoad Dependent Single Chain Models of Multichain Closed Queueing Networks
Often a multichain product form queueing network is used to model a complex computer system. In many cases, the multichain demands are unavailable or are diicult to obtain. In contrast, load dependent demands are often directly measurable. This paper investigates the use of a load dependent single chain model as an approximate model of an actual multichain system. In restricted cases, it is sho...
متن کاملMaximum Entropy Analysis of Queueing Network Models
The principle of Maximum Entropy (ME) provides a consistent method of inference for estimating the form of an unknown discrete-state probability distribution, based on information expressed in terms of tree expected values. In this tutorial paper entropy maximisation is used to characterise product-form approximations and resolution algorithms for arbitrary continuoustime and discrete-time Queu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Performance Evaluation
سال: 2014
ISSN: 0166-5316
DOI: 10.1016/j.peva.2014.09.001